Ants and Graph Coloring
نویسندگان
چکیده
Ants algorithm is an evolutionary search method for solving combinatorial optimization problems. In this note we propose a version of the algorithm for coloring a graph with a fixed number of colors. Based on approximate colorings obtained by single ants, edges of maximal evidence are added so that the new ants generation does only attempt to construct colorings with additional restrictions. Probabilities for addition of misleading edges are shown to be very low. Experimentaly we obtain speedup over not cooperating ants and a long single ant run.
منابع مشابه
Spectrum Assignment in Cognitive Radio Networks Using Fuzzy Logic Empowered Ants
The prevalent communications networks suffer from lack of spectrum and spectrum inefficiency. This has motivated researchers to develop cognitive radio (CR) as a smart and dynamic radio access promised solution. A major challenge to this new technology is how to make fair assignment of available spectrum to unlicensed users, particularly for smart grids communication. This paper introduces an i...
متن کاملAn ant-based algorithm for coloring graphs
This paper presents an ant-based algorithm for the graph coloring problem. An important difference that distinguishes this algorithm from previous ant algorithms is the manner in which ants are used in the algorithm. Unlike previous ant algorithms where each ant colors the entire graph, each ant in this algorithm colors a small portion of the graph using only local information. These individual...
متن کاملHow Good Can Ants Color Graphs?
We compare the ants algorithm for graph coloring recently pro posed by Costa and Hertz with the repeated Recursive Largest First algorithm and with a Petford Welsh type algorithm In our experi ments the later is much better than the rst two
متن کاملAn ACO Algorithm for the Graph Coloring Problem
Ant Colony Optimization (ACO) is a well-known metaheuristic in which a colony of artificial ants cooperates in exploring good solutions to a combinatorial optimization problem. In this paper, an ACO algorithm is presented for the graph coloring problem. This ACO algorithm conforms to Max-Min Ant System structure and exploits a local search heuristic to improve its performance. Experimental resu...
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004